package leetcode.每日一题;

import org.junit.Test;

import java.util.HashMap;
import java.util.Map;

/**
 * @author ：zsy
 * @date ：Created 2021/6/12 9:45
 * @description：
 */
public class 数位成本和为目标值的最大数字 {


    @Test
    public void test() {

    }

    class Solution {
        public String largestNumber(int[] cost, int target) {
            int m = cost.length;
            int[][] dp = new int[m + 1][target + 1];
            Map<Integer, StringBuilder> map = new HashMap<>();
            for (int i = 1; i <= m; i++) {
                for (int j = 1; j <= target; j++) {
                    if (cost[i] <= j) {
                        StringBuilder pre = map.get(dp[i][j - cost[i]]);
                        StringBuilder cur = map.get(dp[i - 1][j]);

                    }
                }
            }
            return "";
        }
    }
}
